Dédoublement Et Partition

ADMISSIBLE PARTITION FOR BL-GENERAL FUZZY AUTOMATON

In this note, we define the concepts of admissible relation and admissible partition for an arbitrary BL-general fuzzy automaton.In particular, a connection between the admissible partition and the quotient BL-general fuzzy automaton is presented.It is shown that if we use the maximal admissible partition, then we obtain a quotient BL-general fuzzy automaton and this quotient is minimal. Finall...

A partition-based algorithm for clustering large-scale software systems

Clustering techniques are used to extract the structure of software for understanding, maintaining, and refactoring. In the literature, most of the proposed approaches for software clustering are divided into hierarchical algorithms and search-based techniques. In the former, clustering is a process of merging (splitting) similar (non-similar) clusters. These techniques suffered from the drawba...

Partition Statistics for Cubic Partition Pairs

In this brief note, we give two partition statistics which explain the following partition congruences: b(5n + 4) ≡ 0 (mod 5), b(7n + a) ≡ 0 (mod 7), if a = 2, 3, 4, or 6. Here, b(n) is the number of 4-color partitions of n with colors r, y, o, and b subject to the restriction that the colors o and b appear only in even parts.

Leptospirose Ovine et Caprine

Partition Search

We introduce a new form of game search called partition search that incorporates dependency analysis, allowing substantial reductions in the portion of the tree that needs to be expanded. Both theoretical results and experimental data are presented. For the game of bridge, partition search provides approximately as much of an improvement over existing methods as a-0 pruning provides over minimax.